Correlation-based color mosaic interpolation adjustment using luminance gradients

ABSTRACT

Processing a digitized image signal includes selectively adjusting interpolated color values on the basis of correlations between pre-identified reference patterns of values and the patterns of values within the neighborhoods in which the interpolated color values reside. The reference patterns may be various possible combinations of a high reference value and a low reference value within a selected neighborhood configuration. When minimum and maximum color values are used as the reference values, the reference patterns are representative of the various maximum luminous gradient possibilities within the selected neighborhood configuration.

TECHNICAL FIELD

[0001] The invention relates generally to processing a digitized image signal and more particularly to adjusting interpolation values to reduce artifacts.

BACKGROUND ART

[0002] A digitized image signal generated by a two-dimensional array of sensors consists of pixel values representing the color intensities at each point of the color image. Conventional color photography utilizes three overlapping color sensing layers having sensitivities in different regions of the color spectrum. Typically, red, green and blue are the three selected colors. However, digital cameras are limited to a single array of sensors, so that there is only one “layer.” Within this layer, each sensor determines the intensity of a particular color. As a result, the color array does not produce a color image in the traditional sense, but rather a collection of individual color samples. The assignment of the colors to the individual pixels within the array is sometimes referred to as the color filter array (CFA), or the color “mosaic pattern.” To produce a true color image in which each pixel has a full set of color samples, a substantial amount of interpolation is required in order to estimate the missing information. The interpolation operation is typically referred to as “demosaicing.”

[0003] The general concept of demosaicing will be described with reference to FIG. 1. An image sensor array 10 for capturing a digitized image signal is represented by a mosaic pattern that follows an arrangement referred to as a Bayer pattern (i.e., a repeating 2×2 sensor array kernel having two green pixels diagonally positioned within the kernel and having one red sensor and one blue sensor). The sensor array is a color-sampling device that acquires its samples using a number of discrete color-specific detectors. By example, the array may have 1500 columns and 1500 rows, but the numbers of columns and rows are not significant to the overall understanding of the process.

[0004] In the demosaicing of the image that is captured by the sensor array 10, the image may be considered as being decomposed into four input image planes 12, 14, 16 and 18. Each input image plane satisfies two conditions. First, the planes have the identical number of samples within a horizontal and vertical sampling interval. Second, all of the samples in the given input image plane have identical color properties, although multiple image planes can have the same color properties. For example, the image planes 12 and 18 have green samples, as indicated by the letter “G.” Image plane 14 includes all of the samples that are specific to the color blue, as indicated by the letter “B,” while image plane 16 includes all of the red samples from the sensor array 10, as indicated by the letter “R.” Alternatively, only three input image planes may be considered, if the two image planes having green samples are combined. While the illustrated embodiment shows a Bayer pattern, other patterns are used by persons skilled in the art.

[0005] In FIG. 1, there are three different colors and there are four possible color arrangements within a two-by-two neighborhood of pixels. The number of possible color arrangements is consistent with the number of image planes 12, 14, 16 and 18. It is possible to use twelve convolution kernels (3×4=12) in the demosaicing process. The twelve convolution kernels are selected on the basis of which of the input image planes contains the sample for the pixel that is to be the current center of a movable neighborhood in which interpolation occurs and on the basis of which monochromatic output plane 20, 22 and 24 is presently being constructed. Each monochromatic output plane contains original color samples and contains interpolated intensity values that are derived from the intensity values of the input image planes.

[0006] To generate the missing information at a particular pixel, information from neighboring pixels is used, since there is a statistical dependency among the pixels in the same region of a particular image. Various demosaicing algorithms are available. “Bilinear interpolation” is an approach that attempts to minimize the complexity of the demosaicing operation. A bilinear interpolation algorithm interpolates color intensities only from the same-color sensors. That is, the information from the red sensors is treated independently from the information from the green and blue sensors. Similarly, the information from the green sensors is treated independently from the red and blue sensors, and the information from the blue sensors is treated independently from the outputs of the red and green sensors. To provide a red intensity value at a given pixel, the values measured by the red sensors in a designated size neighborhood (e.g., in a neighborhood of nine sensors having the given pixel as its center) are interpolated. If the mosaic pattern of sensors is a Bayer pattern, the bilinear interpolation algorithm may use twelve kernels of convolution to reconstruct the image, as previously noted.

[0007] The bilinear interpolation approach of isolating the different colors in the demosaicing operation requires a relatively low level of computational overhead. The tradeoff is that the reconstructed image often contains significant artifacts. Other interpolation approaches that consider different-color sample values may introduce fewer artifacts, but the cost may be a significant increase in the computational overhead.

SUMMARY OF THE INVENTION

[0008] Processing a digitized image signal in accordance with the present invention includes interpolating color values that are based upon color samples of nearby pixel locations, and then selectively adjusting individual interpolated color values according to correlations between pre-identified reference patterns of values and the patterns of values within the neighborhoods in which the interpolated color values reside.

[0009] In a low computation embodiment, the reference patterns are various possible combinations of a high reference value and a low reference value within a selected neighborhood configuration. The high reference value may be a maximum color value of the digitized image signal, while the low reference value may be the minimum color value. When minimum and maximum color values are used, the reference patterns are representative of the various maximum luminous gradient possibilities within the selected neighborhood configuration.

[0010] The reference patterns are selected during the pre-operation setup of the system. Additionally, each reference pattern may be assigned a specific pattern output value that is used to determine an adjustment amount, which may be positive, negative or zero. The adjustment amount is employed to selectively increment or decrement interpolated color values when one of the reference patterns is identified in a correlation process during normal operation of the system.

[0011] The interpolated color values may be determined from the digitized image signal using known techniques. For example, binary interpolation may be employed. Then, the individual interpolated color values are selectively adjusted using correlation processing. As an example, a first interpolated color value (ICV) is adjusted on the basis of identifying a correlation between a particular one of the reference patterns and the pattern of neighboring color values having the first ICV as it its center. That is, in one embodiment, the first ICV is the center value in a neighborhood of color values and the center value is conditionally adjusted, with the conditions being based upon relationships among relevant values, as will be described below. The conditional adjustment is repeated for each interpolated color value.

[0012] Each reference pattern is assigned a “pattern output value.” In the conditional adjustment of each interpolated color value, such as the first ICV, the difference between the interpolated color value and the pattern output value assigned to the reference pattern for which there is a correlation is determined. Thus, the difference between the first ICV and the relevant pattern output value is identified. This difference is referred to as the adjustment amount. The adjustment amount may be positive, negative or zero. The conditional adjustment of the first ICV results in the selection of the appropriate one of (1) the first ICV minus the adjustment amount, (2) the sum of the first ICV and the adjustment amount, and (3) the value of the original color sample for the pixel location of the first ICV. The first option (first ICV minus the adjustment amount) is selected if the first ICV is greater than the pattern output value and if the original color sample is less than the first ICV and is less than first ICV minus the adjustment amount. The second option (i.e., the sum of the first ICV and the adjustment amount) is selected under the condition that the first ICV is less than the pattern output value and under the condition that the value of the original color sample is greater than the first ICV and greater than the sum of the first ICV and the adjustment amount. The third option is selected when the conditions for selecting the first option and the conditions for selecting the second option are not met.

[0013] In application, the invention may be implemented as a kernel that is determined from a priori assumed image characteristics in the form of pre-determined (as opposed to learned) local -sample neighborhood patterns. The procedure attempts to exploit local image sample interdependencies, in order to preserve detail, while minimizing artifacts.

BRIEF DESCRIPTION OF THE DRAWINGS

[0014]FIG. 1 is a schematic representation of a demosaicing operation which may be used as initial steps of the present invention.

[0015]FIG. 2 is a process flow of steps which illustrates the broad concept of the invention.

[0016]FIG. 3 is a schematic view of components which may be used to implement the process flow of steps of FIG. 2.

[0017]FIG. 4 is a more detailed description of the process of FIG. 2.

[0018]FIG. 5 is a detailed description of one embodiment of the selective adjustment step of FIG. 4.

[0019]FIGS. 6 and 7 represent an example of the use of a set of reference patterns to be used when the original center pixel location is red, but the output value is green.

[0020]FIGS. 8 and 9 represent an example of the use of a set of reference patterns to be used when the original center pixel location is red, but the output value is blue.

[0021]FIGS. 10 and 11 represent an example of the use of a set of reference patterns to be used when the original center pixel location is green/red, but the output value is red.

[0022]FIGS. 12 and 13 represent an example of the use of a set of reference patterns to be used when the original center pixel location is green/red, but the output value is blue.

[0023]FIGS. 14 and 15 represent an example of the use of a set of reference patterns to be used when the original center pixel location is green/blue, but the output value is red.

[0024]FIGS. 16 and 17 represent an example of the use of a set of reference patterns to be used when the original center pixel location is green/blue, but the output value is blue.

[0025]FIGS. 18 and 19 represent an example of the use of a set of reference patterns to be used when the original center pixel location is blue, but the output value is red.

[0026]FIGS. 20 and 21 represent an example of the use of a set of reference patterns to be used when the original center pixel location is blue, but the output value is green.

DETAILED DESCRIPTION

[0027] The methodology of the present invention is based on the assumptions that different local sample neighborhoods of images share similar patterns and that the pattern similarities extend across different scales. These assumptions allow a priori information from local sample patterns to be used in calculating final interpolated color values. On the basis of the assumptions, patterns of high-resolution neighborhoods (i.e., sample neighborhoods in which color values for all of the colors are present) are similar to patterns of the corresponding low-resolution neighborhoods (e.g., color mosaic sample neighborhoods). That is, in FIG. 1, the pattern similarity extends from the low-resolution of the color mosaic information from the sensor array 10 to the corresponding high-resolution neighborhoods within the collection of output planes 20, 22 and 24.

[0028] In order to use the methodology, the local sample patterns and their mapping to the corresponding interpolated color values must be defined. Mapping information either can be learned from available data (such as sampled images) or can be derived from assumptions regarding expected image characteristics. The present invention uses the latter approach of employing assumptions concerning expected image characteristics. An overview of the approach will be described with reference to FIG. 2. At step 26, the size and the configuration of the “local” neighborhood is selected. A small, odd-number dimensioned, but square, spatial sample neighborhood has been determined to be a desirable configuration. For example, the local neighborhood may be a 3×3 array of values.

[0029] At step 28, at least one set of reference patterns of reference values is derived. The set of reference patterns may be various combinations of a high reference value and a low reference value within the selected neighborhood size and configuration. The high reference value may be the maximum color value of the digitized image signal that will be considered. Similarly, the low reference value may be the minimum color value of the digitized image signal. Thus, the high reference value may be the number “1,” while the low reference value may be the number “0.” The set of reference patterns will thereby represent various luminance gradient possibilities within the selected neighborhood configuration.

[0030] At step 30, starting luminance values are provided. Steps 26 and 28 may be considered to be setup steps, while steps 30 and 32 may be considered to be execution steps. The starting color luminance values may be bilinear interpolated color values, as explained with reference to FIG. 1.

[0031] At step 32, each starting color luminance value is considered in order to determine whether the value should be adjusted on the basis of identifying neighborhood pattern similarities. For a particular starting color luminance value, its local neighborhood is the one in which the value is at the center of the neighborhood. The neighborhood pattern is compared to the set of local neighborhood reference patterns derived in step 28. Each local neighborhood reference pattern is assigned a specific output value that may be considered the “desired” output value, given the luminance pattern of that reference pattern. This desired output value is compared with the actual starting color luminance value to determine an “adjustment amount.” The starting color luminance value of concern will be adjusted by a maximum of the adjustment amount assigned to the reference pattern having the greatest neighborhood similarity. The adjustment amount is intended to be proportional to the luminance gradient that is characteristic of the reference pattern to which it is assigned. The adjustment direction (i.e., increase, remain the same, or decrease) is toward the original sample value, such as the sample value from the original mosaic image. However, there are rules with regard to the adjustment. A particular interpolated color value can be moved closer to or equivalent to the particular color sample originally assigned to the color sample location for which the interpolated color value was interpolated. With respect to the selective adjustment, the maximum adjustment amount is one in which the adjusted interpolated color value is equivalent to the color sample originally assigned to that color sample location.

[0032] The procedure represented by the overview in FIG. 2 takes into account the assumed correlation between the local neighborhood sample values and the expected center color values. The procedure is intended to improve perceptual quality by driving the overall center color toward a more neutral tone, thus minimizing the perception of chromatic aliasing artifacts (color fringes) near large luminance gradients.

[0033]FIG. 3 illustrates an example of an arrangement of components for a system that implements the procedure of FIG. 2. The system includes a source 33 of an image signal. For example, the source may be the image sensor array 10 of FIG. 1, which generates a Bayer color mosaic pattern. However, the invention may be used with other image sources.

[0034] The image signal from the source 33 is processed by an interpolator 34. As one possibility, the interpolator may perform bilinear interpolation, as was described with reference with FIG. 1, in order to generate the three output planes 20, 22 and 24. As represented in FIG. 3, the interpolator has three separate outputs. The first output 36 provides access to the original uninterpolated color values. The second output 38 provides the interpolated values to a differencing device 42. The third output 40 provides the neighborhoods of values that are correlated with the reference patterns of reference values that were derived in step 28 of FIG. 2. Each neighborhood of sample values that is to be compared with the set of reference patterns has an interpolated value as its center, with the center value being the one under consideration with respect to adjustments in accordance with the invention. In FIG. 3, a pattern correlator 44 provides the comparisons with the set of reference patterns.

[0035] A reference pattern store 46 is used for storage of the various reference patterns. As previously described, the reference patterns may be determined from combinations of minimum and maximum local sample values. For each pattern of minimum and maximum local sample values, an expected (“desired”) pattern output value is assigned. The assignment is based upon rules that will be described in detail below, when referring to FIG. 5.

[0036] In the embodiment shown in FIG. 3, a reference set selector 48 is included. A number of different sets of reference patterns may be derived in the step 28 of FIG. 2. The set that is selected by the selector 48 is dependent upon the configuration of colors within the neighborhood to which the set is to be correlated. That is, for a particular neighborhood of samples from the third output 40 of the interpolator 34, a set of corresponding neighborhoods will be selected from the reference pattern store 46. For the Bayer color mosaic, sets of patterns may arise from (1) different combinations of the minimum and maximum values of the green samples and (2) different combinations of the minimum and maximum values of samples that are the same color as the center color being considered for adjustment. When the interpolated color is green, the only reference patterns that are considered are those arising from the minimum and maximum values of green samples, since there is a high perceptual correlation of green with image luminance.

[0037] To determine the degree and direction of adjustment to the interpolated value under consideration, the pre-assigned pattern output value of a reference pattern is compared with the interpolated value at the center of a pattern for which there is a determined correlation. Thus, after the pattern correlator 44 identifies a correlation between a pattern received from the interpolator 34 and a particular reference pattern from the reference set selector 48, the pre-assigned value of the reference pattern is compared to the interpolated value at the center of the pattern from the interpolator 34. The maximum degree and the direction of adjustment are the difference between the pre-assigned value and the interpolated center value. This difference determines the approximate weighting factors for the mapping of the sample values to the final interpolated output values.

[0038] The differencing device 42 cooperates with a threshold detector 50 and an interpolation adjustor 52 to selectively vary the interpolation values output from the interpolator 34. The adjusted interpolated values are stored at an output signal store 54. The cooperative operations of these components will be described in greater detail with reference to FIGS. 4 and 5.

[0039] In FIG. 4, the step 56 of receiving a local neighborhood pattern of sample values is representative of transmissions from the interpolator 34 of FIG. 3 to the pattern correlator 44 via the third output 40. As previously stated, the local neighborhood may be an odd-number dimensioned, square spatial sample neighborhood. At the center of the local neighborhood is the interpolated center value (ICV) that is under consideration with respect to adjustment. At step 58, the appropriate set of reference patterns is selected by the reference set selector 48. The reference patterns are neighborhoods that are dimensioned to correspond to the local neighborhood pattern of sample values.

[0040] At step 60, the pattern correlator 44 performs its correlation processing to identify a particular reference pattern from the selected set of reference patterns, as indicated at step 62. In the following step 64, the differencing device 42 calculates the difference between the value that was assigned to the identified reference pattern and the ICV of the local neighborhood pattern of sample values. Finally, at step 66, the ICV is potentially adjusted.

[0041] One possible flow of process steps for implementing the step 66 of selectively adjusting the ICV of the local neighborhood pattern is shown in FIG. 5. From the differencing step 64 that is executed by the differencing device 42 of FIG. 3, a number of mathematical calculations are performed by the threshold detector 50. At decision step 68, the difference between the assigned value of the reference pattern and the ICV is considered in order to determine whether the difference is a “negative adjustment.” If the assigned value minus the ICV is negative, the process progresses to step 70. As shown in FIG. 3, the original values (i.e., the uninterpolated values) are supplied to the threshold detector 50. If the original color value (i.e., the sample) that corresponds to the ICV is less than the ICV minus the negative adjustment, decision step 72 is considered. At step 72, it is determined whether the original color value is less than the ICV. Affirmative responses at decision steps 68, 70 and 72 result in an adjustment to the ICV, as indicated at step 74. The adjusted ICV is the difference between the ICV and the negative adjustment value. On the other hand, if a negative response is generated at either decision step 70 or decision step 72, the output from the interpolator adjustor 52 is the original color value, as indicated at step 76.

[0042] Returning to decision step 68, if a negative response is generated, the determination is made at step 78 of whether the difference between the assigned valued of the reference pattern and the ICV is a positive adjustment value. If the difference is a positive adjustment, step 80 determines whether the sum of the ICV and the positive adjustment value is exceeded by the original color value for the sample that corresponds to the position of the ICV being considered. If “yes,” step 82 determines whether the original color value is greater than the ICV. Affirmative responses at steps 80 and 82 result in the step 84 of outputting an adjusted ICV that is the sum of the ICV and the positive adjustment value. A negative response at either step 80 or step 82 results in the original color value being used as the adjusted ICV (step 76).

[0043] The flow of steps of FIG. 5 may be stated mathematically. For an N×N element mosaic, where N is an odd number, the methodology may be presented in the general form: $\begin{matrix} {\hat{x} = {{f\left( {x\left\lbrack {n_{1},n_{2}} \right\rbrack} \right)} = \left\{ {\begin{matrix} {\overset{\_}{x} - {\overset{\sim}{x}}_{neg}} \\ {\overset{\_}{x} + {\overset{\sim}{x}}_{pos}} \\ x_{cent} \end{matrix}\begin{matrix} {{{{if}\quad \overset{\_}{x}} > {{x_{cent}\quad {and}\quad \overset{\_}{x}} - {\overset{\sim}{x}}_{neg}} > x_{cent}},} \\ {{{{if}\quad \overset{\_}{x}} < {{x_{cent}\quad {and}\quad \overset{\_}{x}} + {\overset{\sim}{x}}_{pos}} < x_{cent}},{or}} \\ {otherwise} \end{matrix}} \right.}} & {{Eq}.\quad 1} \end{matrix}$

[0044] where {circumflex over (x)} is the adjusted ICV at either step 74, 76 or 84, x[n₁,n₂] is the local neighborhood having ICV as its center, where n₁, n₂=0, 1, . . . , N−1 is the local neighborhood sample value 2D array, {overscore (x)} is the local neighborhood ICV prior to adjustment, {tilde over (x)}_(neg) and {tilde over (x)}_(pos) are, respectively, the local-neighborhood-based negative and positive adjustment values, and x_(cent) is the original color value that is considered in steps 70, 72, 80 and 82.

[0045] As can be seen by either viewing the process steps of FIG. 5 or Eq. 1, if the interpolation process that is performed at the interpolator 34 of FIG. 3 results in an increase relative to the original color value, the interpolated color value is reduced, but only to the extent that it reaches the original color value (steps 70, 72 and 74, along with step 76). Similarly, if the interpolation at the interpolator 34 drove the value downwardly, the value is increased, but only to the extent that it reaches the original color value (steps 80, 82 and 84, along with step 76).

[0046] Forms for the individual red, green and blue interpolated color values of a Bayer color filter mosaic are: $\begin{matrix} {{\hat{x}}_{red} = \left\{ {\begin{matrix} {{\overset{\_}{x}}_{red} - {\overset{\sim}{x}}_{{neg}{red}}} \\ {{\overset{\_}{x}}_{red} + {\overset{\sim}{x}}_{posred}} \\ x_{cent} \end{matrix}\begin{matrix} {{{{if}\quad {\overset{\_}{x}}_{red}} > {{x_{cent}\quad {and}\quad {\overset{\_}{x}}_{red}} - {\overset{\sim}{x}}_{negred}} > x_{cent}},} \\ {{{{if}\quad {\overset{\_}{x}}_{red}} < {{x_{cent}\quad {and}\quad {\overset{\_}{x}}_{red}} + {\overset{\sim}{x}}_{posred}} < x_{cent}},{or}} \\ {otherwise} \end{matrix}} \right.} & {{Eq}.\quad 2} \\ {{\hat{x}}_{grn} = \left\{ {\begin{matrix} {{\overset{\_}{x}}_{grn} - {\overset{\sim}{x}}_{neggrn}} \\ {{\overset{\_}{x}}_{grn} + {\overset{\sim}{x}}_{posgrn}} \\ x_{cent} \end{matrix}\begin{matrix} {{{{if}\quad {\overset{\_}{x}}_{grn}} > {{x_{cent}\quad {and}\quad {\overset{\_}{x}}_{grn}} - {\overset{\sim}{x}}_{neggrn}} > x_{cent}},} \\ {{{{if}\quad {\overset{\_}{x}}_{grn}} < {{x_{cent}\quad {and}\quad {\overset{\_}{x}}_{grn}} + {\overset{\sim}{x}}_{posgrn}} < x_{cent}},{or}} \\ {otherwise} \end{matrix}} \right.} & {{Eq}.\quad 3} \\ {{\hat{x}}_{blu} = \left\{ {\begin{matrix} {{\overset{\_}{x}}_{blu} - {\overset{\sim}{x}}_{negblu}} \\ {{\overset{\_}{x}}_{blu} + {\overset{\sim}{x}}_{posblu}} \\ x_{cent} \end{matrix}\begin{matrix} {{{{if}\quad {\overset{\_}{x}}_{blu}} > {{x_{cent}\quad {and}\quad {\overset{\_}{x}}_{blu}} - {\overset{\sim}{x}}_{negblu}} > x_{cent}},} \\ {{{{if}\quad {\overset{\_}{x}}_{blu}} < {{x_{cent}\quad {and}\quad {\overset{\_}{x}}_{blu}} + {\overset{\sim}{x}}_{posblu}} < x_{cent}},{or}} \\ {otherwise} \end{matrix}} \right.} & {{Eq}.\quad 4} \end{matrix}$

[0047] where {circumflex over (x)}_(red), {circumflex over (x)}_(grn) and {circumflex over (x)}_(blu) are the output adjusted red, green and blue ICVs (from steps 74, 76 and 84), {overscore (x)}_(red), {overscore (x)}_(grn) and {overscore (x)}_(blu) are the red, green and blue ICVs prior to adjustment, {tilde over (x)}_(negred), {tilde over (x)}_(posred), {tilde over (x)}_(neggrn), {tilde over (x)}_(posgrn), {tilde over (x)}_(negblu) and {tilde over (x)}_(posblu) are the red, green and blue negative and positive adjustment values identified in steps 68 and 78.

[0048] The negative and the positive adjustment values {tilde over (x)}_(neg) and {tilde over (x)}_(pos) are:

[0049] $\begin{matrix} {{\overset{\sim}{x}}_{neg} = {\max\limits_{d}\left\lbrack {w_{{negpat}_{d}}{f_{{negpat}_{d}}(x)}} \right\rbrack}} & {{Eq}.\quad 5} \\ {{\overset{\sim}{x}}_{pos} = {\max\limits_{d}\left\lbrack {{w_{pospat}}_{d}{f_{{pospat}_{d}}(x)}} \right\rbrack}} & {{Eq}.{\quad \quad}6} \end{matrix}$

[0050] where d=0, 1, . . . , D−1 is the appropriate pattern dimension index, w_(negpat) _(d) and w_(pospat) _(d) are adjustment weights for the negative and positive adjustments, and f_(negpat) _(d) (x) and f_(pospat) _(d) (x) are negative and positive adjustment functions of local neighborhood sample patterns.

[0051] Forms for individual negative and positive adjustment values for red, green and blue in a Bayer color filter mosaic are: $\begin{matrix} {{{\overset{\sim}{x}}_{negred} = {\max\limits_{d}\left\lbrack {w_{{negredpat}_{d}}{f_{{negredpat}_{d}}(x)}} \right\rbrack}},} & {{Eq}.\quad 7} \\ {{{\overset{\sim}{x}}_{posred} = {\max\limits_{d}\left\lbrack {w_{{posredpat}_{d}}{f_{{posredpat}_{d}}(x)}} \right\rbrack}},} & {{Eq}.\quad 8} \\ {{{\overset{\sim}{x}}_{neggrn} = {\max\limits_{d}\left\lbrack {w_{{neggrnpat}_{d}}{f_{{neggrnpat}_{d}}(x)}} \right\rbrack}},} & {{Eq}.\quad 9} \\ {{{\overset{\sim}{x}}_{posgrn} = {\max\limits_{d}\left\lbrack {w_{{posgrnpat}_{d}}{f_{{posgrnpat}_{d}}(x)}} \right\rbrack}},} & {{Eq}.\quad 10} \\ {{{\overset{\sim}{x}}_{negblu} = {\max\limits_{d}\left\lbrack {w_{{negblupat}_{d}}{f_{{negblupat}_{d}}(x)}} \right\rbrack}},} & {{Eq}.\quad 11} \\ {{{\overset{\sim}{x}}_{posblu} = {\max\limits_{d}\left\lbrack {w_{{posblupat}_{d}}{f_{{posblupat}_{d}}(x)}} \right\rbrack}},} & {{Eq}.\quad 12} \end{matrix}$

[0052] where w_(negredpat) _(d′) w_(posredpat) _(d) , w_(neggrnpat) _(d) , w_(posgrnpat) _(d) , w_(negblupat) _(d) , w_(posblupat) _(d) , f_(negredpat) _(d) (x), f_(posredpat) _(d) (x), f_(neggrnpat) _(d) (x), f_(posgrnpat) _(d) (x), f_(negblupat) _(d) (x), f_(posblupat) _(d) (x) are adjustment weights and functions of local neighborhood sample patterns for red, green and blue interpolation.

[0053] The local neighborhood sample pattern functions are: $\begin{matrix} {{f_{{negpat}_{d}}(x)} = \left\{ {\begin{matrix} {{\max \left\lbrack {{f_{{neg}_{d}}(x)} + {f_{{neg}_{d}}\left( x_{grn} \right)} + {f_{{neg}_{d}}\left( x_{cent} \right)}} \right\rbrack} - b_{d}} \\ 0 \end{matrix}\begin{matrix} {{{{if}\quad {\max \left\lbrack . \right\rbrack}} > b_{d}},{or}} \\ {otherwise} \end{matrix}} \right.} & {{Eq}.\quad 13} \\ {{f_{{pospat}_{d}}(x)} = \left\{ {\begin{matrix} {{\max \left\lbrack {{f_{{pos}_{d}}(x)} + {f_{{pos}_{d}}\left( x_{grn} \right)} + {f_{{pos}_{d}}\left( x_{cent} \right)}} \right\rbrack} - b_{d}} \\ 0 \end{matrix}\begin{matrix} {{{{if}\quad {\max \left\lbrack . \right\rbrack}} > b_{d}},{or}} \\ {otherwise} \end{matrix}} \right.} & {{Eq}.\quad 14} \end{matrix}$

[0054] where b_(d) is an activation threshold bias term, f_(neg) _(d) (x) and f_(pos) _(d) (x) are functions of the local neighborhood samples that are the same color as the color being interpolated (except green samples), f_(neg) _(d) (x_(grn)) and f_(pos) _(d) (x_(grn)) are functions of the local neighborhood green samples (except a center sample), and f_(neg) _(d) (x_(cent)) and f_(pos) _(d) _(^(d)) (x_(cent)) are functions of the center sample (red, green or blue). Note that the bias term b_(d) performs a variable activation thresholding function, with f_(negpat) _(d) (x), f_(pospat) _(d)(x)>0 only if max[.]>b_(d).

[0055] The local neighborhood sample pattern functions for red, green and blue interpolation are: $\begin{matrix} {{f_{{negredpat}_{d}}(x)} = \left\{ {\begin{matrix} {{\max \left\lbrack {{f_{{neg}_{d}}\left( x_{red} \right)} + {f_{{neg}_{d}}\left( x_{grn} \right)} + {f_{{neg}_{d}}\left( x_{cent} \right)}} \right\rbrack} - b_{d}} \\ 0 \end{matrix}\begin{matrix} {{{{if}\quad {\max \lbrack \cdot \rbrack}} > b_{d}},{or}} \\ {otherwise} \end{matrix}} \right.} & {{Eq}.\quad 15} \\ {{f_{{posredpat}_{d}}(x)} = \left\{ {\begin{matrix} {{\max \left\lbrack {{f_{{pos}_{d}}\left( x_{red} \right)} + {f_{{pos}_{d}}\left( x_{grn} \right)} + {f_{{pos}_{d}}\left( x_{cent} \right)}} \right\rbrack} - b_{d}} \\ 0 \end{matrix}\begin{matrix} {{{{if}\quad {\max \lbrack \cdot \rbrack}} > b_{d}},{or}} \\ {otherwise} \end{matrix}} \right.} & {{Eq}.\quad 16} \\ {{f_{{neggrnpat}_{d}}(x)} = \left\{ {\begin{matrix} {{\max \left\lbrack {{f_{{neg}_{d}}\left( x_{grn} \right)} + {f_{{neg}_{d}}\left( x_{cent} \right)}} \right\rbrack} - b_{d}} \\ 0 \end{matrix}\begin{matrix} {{{{if}\quad {\max \lbrack \cdot \rbrack}} > b_{d}},{or}} \\ {otherwise} \end{matrix}} \right.} & {{Eq}.\quad 17} \\ {{f_{{posgrnpat}_{d}}(x)} = \left\{ {\begin{matrix} {{\max \left\lbrack {{f_{{pos}_{d}}\left( x_{grn} \right)} + {f_{{pos}_{d}}\left( x_{cent} \right)}} \right\rbrack} - b_{d}} \\ 0 \end{matrix}\begin{matrix} {{{{if}\quad {\max \lbrack \cdot \rbrack}} > b_{d}},{or}} \\ {otherwise} \end{matrix}} \right.} & {{Eq}.\quad 18} \\ {{f_{{negblupat}_{d}}(x)} = \left\{ {\begin{matrix} {\left. {{\max \left\lbrack {{f_{{neg}_{d}}\left( x_{blu} \right)} + {f_{{neg}_{d}}\left( x_{grn} \right)}} \right\rbrack} + {f_{{neg}_{d}}\left( x_{cent} \right)}} \right\rbrack - b_{d}} \\ 0 \end{matrix}\begin{matrix} {{{{if}\quad {\max \lbrack \cdot \rbrack}} > b_{d}},{or}} \\ {otherwise} \end{matrix}} \right.} & {{Eq}.\quad 19} \\ {{f_{{posblupat}_{d}}(x)} = \left\{ {\begin{matrix} {\left. {{\max \left\lbrack {{f_{{pos}_{d}}\left( x_{blu} \right)} + {f_{{pos}_{d}}\left( x_{grn} \right)}} \right\rbrack} + {f_{{pos}_{d}}\left( x_{cent} \right)}} \right\rbrack - b_{d}} \\ 0 \end{matrix}\begin{matrix} {{{{if}\quad {\max \lbrack \cdot \rbrack}} > b_{d}},{or}} \\ {otherwise} \end{matrix}} \right.} & {{Eq}.\quad 20} \end{matrix}$

[0056] where f_(neg) _(d) (x_(red)), f_(pos) _(d) (x_(red)), f_(neg) _(d) (x_(grn)), f_(pos) _(d) (x_(grn)), f_(n)eg _(d) (x_(blu)), f_(pos) _(d) (x_(blu)), are negative and positive functions of the local neighborhood red, green and blue samples, except the center sample.

[0057] The negative and positive local neighborhood sample functions are: $\begin{matrix} {{f_{{neg}_{d}}(x)} = {\sum\limits_{n_{1},n_{2},p}\quad {{w_{neg}\left\lbrack {n_{1},n_{2},p,d} \right\rbrack}{x\left\lbrack {n_{1},n_{2}} \right\rbrack}}}} & {{Eq}.\quad 21} \\ {{f_{{pos}_{d}}(x)} = {\sum\limits_{n_{1},n_{2},p}\quad {{w_{pos}\left\lbrack {n_{1},n_{2},p,d} \right\rbrack}{x\left\lbrack {n_{1},n_{2}} \right\rbrack}}}} & {{Eq}.\quad 22} \end{matrix}$

[0058] where p=0, 1, . . . , P−1 is the pattern index, and w_(neg)[·], w_(pos)[·]∈{˜1, 1} are sample weights, with ˜1 defined as the one's complement of the sample value in base-2, unsigned-binary representation. The same 2D location indices n₁, n₂ are restricted to values from 0, 1, . . . , N−1 where the required color sample is present in the mosaic.

[0059] The local neighborhood sample functions for red, green, blue and center samples are: $\begin{matrix} {{f_{{neg}_{d}}\left( x_{red} \right)} = {\sum\limits_{n_{1},n_{2},p}\quad {{w_{negred}\left\lbrack {n_{1},n_{2},p,d} \right\rbrack}{x_{red}\left\lbrack {n_{1},n_{2}} \right\rbrack}}}} & {{Eq}.\quad 23} \\ {{f_{{pos}_{d}}\left( x_{red} \right)} = {\sum\limits_{n_{1},n_{2},p}\quad {{w_{posred}\left\lbrack {n_{1},n_{2},p,d} \right\rbrack}{x_{red}\left\lbrack {n_{1},n_{2}} \right\rbrack}}}} & {{Eq}.\quad 24} \\ {{f_{{neg}_{d}}\left( x_{grn} \right)} = {\sum\limits_{n_{1},n_{2},p}\quad {{w_{neggrn}\left\lbrack {n_{1},n_{2},p,d} \right\rbrack}{x_{grn}\left\lbrack {n_{1},n_{2}} \right\rbrack}}}} & {{Eq}.\quad 25} \\ {{f_{{pos}_{d}}\left( x_{grn} \right)} = {\sum\limits_{n_{1},n_{2},p}\quad {{w_{posgrn}\left\lbrack {n_{1},n_{2},p,d} \right\rbrack}{x_{grn}\left\lbrack {n_{1},n_{2}} \right\rbrack}}}} & {{Eq}.\quad 26} \\ {{f_{{neg}_{d}}\left( x_{blu} \right)} = {\sum\limits_{n_{1},n_{2},p}\quad {{w_{negblu}\left\lbrack {n_{1},n_{2},p,d} \right\rbrack}{x_{blu}\left\lbrack {n_{1},n_{2}} \right\rbrack}}}} & {{Eq}.\quad 27} \\ {{f_{{pos}_{d}}\left( x_{blu} \right)} = {\sum\limits_{n_{1},n_{2},p}\quad {{w_{posblu}\left\lbrack {n_{1},n_{2},p,d} \right\rbrack}{x_{blu}\left\lbrack {n_{1},n_{2}} \right\rbrack}}}} & {{Eq}.\quad 28} \\ {{f_{{neg}_{d}}\left( x_{cent} \right)} = \left\{ \begin{matrix} {{{w_{negred}\left\lbrack {\frac{N - 1}{2},\frac{N - 1}{2},d} \right\rbrack}{x_{red}\left\lbrack {\frac{N - 1}{2},\frac{N - 1}{2}} \right\rbrack}\quad {for}\quad {red}\quad {center}\quad {sample}},} \\ {{{w_{neggrn}\left\lbrack {\frac{N - 1}{2},\frac{N - 1}{2},d} \right\rbrack}{x_{grn}\left\lbrack {\frac{N - 1}{2},\frac{N - 1}{2}} \right\rbrack}\quad {for}\quad {green}\quad {center}\quad {sample}},{or}} \\ {{w_{negblu}\left\lbrack {\frac{N - 1}{2},\frac{N - 1}{2},d} \right\rbrack}{x_{blu}\left\lbrack {\frac{N - 1}{2},\frac{N - 1}{2}} \right\rbrack}\quad {for}\quad {blue}\quad {center}\quad {sample}} \end{matrix} \right.} & {{Eq}.\quad 29} \\ {{f_{{pos}_{d}}\left( x_{cent} \right)} = \left\{ \begin{matrix} {{{w_{posred}\left\lbrack {\frac{N - 1}{2},\frac{N - 1}{2},d} \right\rbrack}{x_{red}\left\lbrack {\frac{N - 1}{2},\frac{N - 1}{2}} \right\rbrack}\quad {for}\quad {red}\quad {center}\quad {sample}},} \\ {{{w_{posgrn}\left\lbrack {\frac{N - 1}{2},\frac{N - 1}{2},d} \right\rbrack}{x_{grn}\left\lbrack {\frac{N - 1}{2},\frac{N - 1}{2}} \right\rbrack}\quad {for}\quad {green}\quad {center}\quad {sample}},{or}} \\ {{w_{posblu}\left\lbrack {\frac{N - 1}{2},\frac{N - 1}{2},d} \right\rbrack}{x_{blu}\left\lbrack {\frac{N - 1}{2},\frac{N - 1}{2}} \right\rbrack}\quad {for}\quad {blue}\quad {center}\quad {sample}} \end{matrix} \right.} & {{Eq}.\quad 30} \end{matrix}$

[0060] The sample 2D location indices n₁, n₂ are restricted to values from 0, 1, . . . , N−1, where the corresponding sample value is present in the mosaic.

Example of Implementation

[0061] As one example of the implementation of the invention, FIG. 6 through FIG. 21 show different sets of reference patterns. Each even-numbered figure shows reference patterns 86 for one of the eight possible input-output configurations of the Bayer mosaic pattern, while each odd-numbered figure shows both the pattern sample locations 88 and the pattern output value assignments 90 for the preceding even-numbered figure. There are eight possible input-output configurations, since there are four different Bayer color sample types, with each having two interpolated center color outputs. The four different Bayer color sample types are:

[0062] (1) Red samples (R),

[0063] (2) Green samples in rows with red samples (GR),

[0064] (3) Green samples in rows with blue samples (GB), and

[0065] (4) Blue samples (B).

[0066] The patterns grouped according to their center sample colors are:

[0067] R-Center Patterns={R-Center G-Output Patterns, (FIG. 6)

[0068] R-Center B-Output Patterns}, (FIG. 8)

[0069] GR-Center Patterns={GR-Center R-Output Patterns, (FIG. 10)

[0070] GR-Center B-Output Patterns}, (FIG. 12)

[0071] GB-Center Patterns={GB-Center R-Output Patterns, (FIG. 14)

[0072] GB-Center B-Output Patterns}, (FIG. 16)

[0073] B-Center Patterns={B-Center R-Output Patterns, (FIG. 18)

[0074] B-Center G-Output Patterns}. (FIG. 20)

[0075] The pattern number, P, is equal to the total number of input-output configurations, so P=8 for this case.

[0076] For the reference patterns 86 of FIG. 6-21, the notation x, {circumflex over (x)}∈{0,1} applies, where x, {circumflex over (x)}=0 represents the smallest value, x, {circumflex over (x)}=1 represents the largest value, and x=X represents a value of input sample x that is irrelevant to the interpolated color output value {circumflex over (x)}. The {circumflex over (x)} output values are assigned according to the assumptions that were identified previously. For a center sample value of either x_(cent)=0 or x_(cent)=1 in the patterns, the output {circumflex over (x)} is assigned a value of either {circumflex over (x)}=0 or {circumflex over (x)}=1, such that {circumflex over (x)} is equal to the center sample value when the pattern shows a large luminance gradient.

[0077] FIGS. 6-21 also show the assigned values of {tilde over (x)}_(neg) and {tilde over (x)}_(pos). The direction of the selective adjustment to the interpolated value ({overscore (x)}) is indicated by the directions of the diagonal lines. Specifically, a diagonal line extending downwardly with movement from left to right indicates a positive value ({tilde over (x)}_(pos)), while a diagonal line extending upwardly with movement to the right indicates a negative value ({tilde over (x)}_(neg)). The degree of adjustment is indicated by the numbers 0, 1, 2, 3 and 4, with the higher numbers indicating a greater degree of adjustment. For no adjustment (i.e., {tilde over (x)}_(neg), {tilde over (x)}_(pos)=0), no diagonal line is shown.

[0078] The degree and the direction of adjustment are defined from the pattern sample values as the difference between the assigned output value and the interpolated value, shown by rearranging Eq. 1 as: $\begin{matrix} {{\overset{\sim}{x}}_{neg} = \left\{ {\begin{matrix} {{\hat{x} - \overset{\_}{x}}} \\ 0 \end{matrix}\begin{matrix} {{{{{for}\quad \hat{x}} -} < 0},{or}} \\ {otherwise} \end{matrix}{and}} \right.} & {{Eq}.\quad 31} \\ {{\overset{\sim}{x}}_{pos} = \left\{ {\begin{matrix} {{\hat{x} - \overset{\_}{x}}} \\ 0 \end{matrix}\begin{matrix} {{{{{for}\quad \hat{x}} -} < 0},{or}} \\ {otherwise} \end{matrix}} \right.} & {{Eq}.\quad 32} \end{matrix}$

[0079] For sample pattern values quantized to x, {tilde over (x)}∈{0, 1}, the possible adjusted interpolated values are {overscore (x)}∈{0, 0.25, 0.5, 0.75, 1}. From Eq. 31 and Eq. 32, the possible adjustment values are therefore {tilde over (x)}_(neg), {tilde over (x)}_(pos)∈{0, 0.25, 0.5, 0.75, 1}. These values determine the adjustment weights w_(negpat) _(d) and w_(pospat) _(d) values of Eq. 5 and Eq. 6. The weights w_(negpat) _(d) and w_(pospat) _(d) are defined as being equal to the change in {tilde over (x)}_(neg) _(d) and {tilde over (x)}_(pos) _(d) versus the change in the input sample pattern functions f_(negpat)(x) and f_(pospat)(x), shown by rearranging Eq. 5 and Eq. 6 as: $\begin{matrix} {w_{{negpat}_{d}} = {\frac{{\overset{\sim}{x}}_{{neg}_{d}}}{f_{{negpat}_{d}}(x)}\quad {and}}} & {{Eq}.\quad 33} \\ {w_{{pospat}_{d}} = {\frac{{\overset{\sim}{x}}_{{pos}_{d}}}{f_{{pospat}_{d}}(x)}\quad {and}}} & {{Eq}.\quad 34} \end{matrix}$

[0080] The {tilde over (x)}_(neg) and {tilde over (x)}_(pos) values above are equal to the change in {tilde over (x)}_(neg) and {tilde over (x)}_(pos) over the full range of f_(negpat)(x) and f_(pospat)(x), as produced by the entire range of associated input values, from the full pattern value, to the full complement of the same pattern value. Therefore, the w_(negpat) _(d) and w_(pospat) _(d) values are numerically equivalent to the {tilde over (x)}_(neg) _(d) and {tilde over (x)}_(pos) _(d) values, i.e., w_(negpat) _(d) , w_(pospat) _(d) ={tilde over (x)}_(neg) _(d) , {tilde over (x)}_(pos)∈{0, 0.25, 0.5, 0.75, 1}. Also, the dimension number D is equal to the total number of {tilde over (x)}_(neg) _(d) or {tilde over (x)}_(pos) _(d) values. For the 3×3 Bayer mosaic under consideration, D=5.

[0081] For each different adjustment degree and direction {tilde over (x)}_(neg) _(d) and {tilde over (x)}_(pos) _(d) shown in FIGS. 6-21, separate input-output transfer function equations are developed from the pattern values, as given by Eq. 21 and Eq. 22. These equations are then algebraically reduced to minimized equations. With the pattern input values already quantized to x∈{0, 1}, the pattern adjustment output values are likewise quantized to {tilde over (x)}∈{0, 1}, with {tilde over (x)} set to {tilde over (x)}=1 for any non-zero {tilde over (x)} value, and set to {tilde over (x)}=0 otherwise. This allows the use of standard Boolean algebraic minimization techniques to minimize the equations. The outputs of the minimized equations are summed and thresholded as shown in Eq. 13 and Eq. 14. These equation outputs are then scaled by their particular w_(negpat) _(d) and w_(pospat) _(d) values, and either added to or subtracted from the interpolated value {tilde over (x)} to form the final output value {tilde over (x)}, as shown by Eqs. 1, 5 and 6.

[0082] Examination of FIG. 6 through FIG. 21 reveals that out of the eight different input-output configurations, only three unique pattern sets exist. Grouping together identical pattern sets, the three groups of unique pattern sets are:

[0083] Patterns Group 1={R-Center G-Output Patterns, (FIG. 6)

[0084] R-Center B-Output Patterns}, (FIG. 20)

[0085] Patterns Group 2={R-Center B-Output Patterns, (FIG. 8)

[0086] B-Center R-Output Patterns}, (FIG. 18)

[0087] Patterns Group 3={GR-Center R-Output Patterns, (FIG. 10)

[0088] GR-Center B-Output Patterns, (FIG. 12)

[0089] GB-Center R-Output Patterns, (FIG. 14)

[0090] GB-Center B-Output Patterns}. (FIG. 16)

[0091] This grouping allows the total number of interpolation kernels to be restricted to three, the total number of unique pattern sets. The patterns shown according to their group designations are:

[0092] R-Center Patterns={R-Center G-Output Patterns, (Group 1)

[0093] R-Center B-Output Patterns}, (Group 2)

[0094] GR-Center Patterns={GR-Center R-Output Patterns, (Group 3)

[0095] GR-Center B-Output Patterns}, (Group 3)

[0096] GB-Center Patterns={GB-Center R-Output Patterns, (Group 3)

[0097] GB-Center B-Output Patterns}, (Group 3)

[0098] B-Center Patterns={B-Center R-Output Patterns, (Group 2)

[0099] B-Center G-Output Patterns}. (Group 1)

[0100] This indicates a requirement for two sets of hardware implementing the Group 3 pattern interpolation for concurrently obtaining the two interpolated center color values of the GR-center and GB-center configurations.

[0101] B-Center Patterns={B-Center R-Output Patterns, (FIG. 18)

[0102] B-Center G-Output Patterns}. (FIG. 20) 

What is claimed is:
 1. A method of processing a digitized image signal that is representative of color sample locations arranged in columns and rows in which different color sample locations are originally specific to different colors comprising: interpolating color values for said color sample locations, thereby associating each of a plurality of said color sample locations with interpolated color values of colors for which said color sample locations are not originally specific; for each of a plurality of individual said interpolated color values, comparing a pattern of neighboring values of said individual interpolated color value to a set of reference patterns of reference values; and selectively adjusting said interpolated color values on a basis of correlations between said reference patterns and said pattern of neighboring values of said individual interpolated color values, thereby providing output color values.
 2. The method of claim 1 further comprising selecting said set of reference patterns as various combinations of a high reference value and a low reference value within a selected neighborhood configuration of said reference values.
 3. The method of claim 2 wherein said high reference value is a maximum color value of said digitized image signal and said low reference value is a minimum color value of said digitized image signal, said set of reference patterns thereby being representative of various luminance gradient possibilities within said selected neighborhood configuration, wherein said comparing includes identifying a particular said reference pattern by correlating said luminance gradient possibilities with said pattern of neighboring values of said individual interpolated color value.
 4. The method of claim 3 wherein said selecting said set of reference patterns includes deriving said reference patterns as: (1) different combinations of said minimum and maximum color values for green; and (2) different combinations of said minimum and maximum color values for a same color as said individual interpolated color value being adjusted.
 5. The method of claim 1 wherein each said interpolated color value that is adjusted for said selective adjusting is moved closer to or equivalent to the particular said color sample originally assigned to the color sample location for which said interpolated color value was interpolated.
 6. The method of claim 5 wherein each said reference pattern is assigned a pattern output value, said adjusting of said interpolated color value including identifying an adjustment amount as a function of a difference between said interpolated color value and said pattern output value assigned to a specific said reference pattern for which a correlation is determined during said comparing; and wherein said identifying an adjustment amount occurs for each said interpolated color value (ICV), said selective adjusting for said each ICV being a step of selecting one of: (1) said ICV minus said adjustment amount under the condition that said originally assigned color sample is less than said ICV and less than said ICV minus said adjustment amount and under the condition that said ICV is greater than said assigned pattern output value; (2) a sum of said ICV and said adjustment amount under the condition that said originally assigned color sample is greater than said ICV and greater than said sum and under the condition that said ICV is less than said assigned pattern output value; and (3) said originally assigned color sample if said conditions of (1) and (2) are not satisfied.
 7. The method of claim 1 further comprising providing said digitized image signal as a frame of image information in which pixels of said frame are said color sample locations, said frame having a mosaic configuration of said different colors.
 8. The method of claim 7 wherein said interpolating uses binary interpolation techniques to provide demosaicing of said frame and wherein: (1) said frame includes said color samples; (2) said binary interpolation techniques are utilized with respect to said color samples to derive said interpolated color values; and (3) said output color values are determined by adjusting selected said interpolated color values on the basis of said color samples.
 9. The method of claim 1 further comprising selecting said set of reference patterns such that each said reference pattern has a square configuration defined by sides having an odd number of said color sample locations.
 10. A method of processing an image signal comprising: (a) receiving said image signal as luminance values in a mosaic arrangement of pixel locations in which different said pixel locations are specific to different colors; (b) demosaicing said image signal by determining interpolated luminance values, such that each said pixel location is associated with a pre-demosaicing luminance value to which said pixel location is specific and at least one said interpolated luminance value; (c) identifying a particular interpolated luminance value and a neighborhood of said pixel locations in which said particular interpolated luminance value is at a central pixel location, said neighborhood having a luminance gradient pattern; (d) correlating said luminance gradient pattern with predetermined reference luminance gradient patterns to which pattern output values have been assigned, including associating one of said pattern output values with said particular interpolated luminance value on a basis of said pattern-to-pattern correlating; (e) repeating (c) and (d) for each of a plurality of said interpolated luminance values; and (f) determining adjusted interpolated luminance values as functions of relationships of said interpolated luminance values with selected pattern output values.
 11. The method of claim 10 further comprising defining sets of said reference luminance gradient patterns in which each set is unique with respect to a combination of a color and a localized color scheme within said mosaic arrangement.
 12. The method of claim 11 further comprising assigning one of said pattern output values to each said reference luminance gradient pattern based on the specific set in which said reference luminance gradient pattern resides.
 13. The method of claim 12 wherein assigning said determining said adjusted interpolated luminance values includes defining negative values, zero values and positive adjustment values for said interpolated luminance values, said adjustment values being differences between said interpolated luminance values and said pattern output values.
 14. The method of claim 10 wherein said determining each said adjusted interpolation luminance value for each said pixel location includes limiting each adjustment to a direction of said pre-demosaicing luminance value of said pixel location and limiting said variation to be less than or equal to a difference between said pre-mosaicing luminance value and said interpolated luminance value being adjusted.
 15. The method of claim 10 wherein said reference luminance gradient patterns are defined as different possible combinations of minimums and maximums within a preselected neighborhood configuration of pixels.
 16. The method of claim 15 further comprising defining said neighborhood configuration to be square and to have sides that consist of an odd number of said pixels.
 17. The method of claim 10 wherein said image signal is acquired from an array of pixel sensors and wherein said demosaicing includes using binary interpolation techniques.
 18. A system for processing a digitized image signal comprising: a source of a digitized image signal representative of a mosaic arrangement of pixel locations in which different pixel locations have color samples specific to different colors; an interpolator cooperative with said source and enabled to derive interpolated color values for said pixel locations based on said color samples of nearby pixel locations; a selector for identifying a set of reference patterns of reference values to be used in determining a possible adjustment to a specific said interpolated color value; a pattern correlator having inputs of said interpolated color values and said reference patterns, said pattern correlator being enabled to correlate a pattern of values nearby each said interpolated color value with one of said reference patterns; and an interpolation adjustor operatively associated with said pattern correlator to selectively vary said interpolated color values based on weights assigned to said reference patterns with which correlations are identified by said pattern correlator.
 19. The system of claim 18 wherein said selector has access to storage of multiple said sets of reference patterns, each said set being specific to one of said colors and being specific to a particular localized configuration of colors in a neighborhood in which said specific one color is the color of said specific interpolated value to be possibly adjusted.
 20. The system of claim 18 further comprising a threshold detector in cooperation with said interpolation adjustor to limit any specific variation of any said interpolated color value to the direction of said color sample of the same pixel location of said interpolated color value and to limit said specific variation to a difference between said interpolated color value and said color sample of said same pixel location.
 21. The system of claim 18 wherein said interpolation adjustor is configured to calculate positive, negative and zero adjustment values on a basis of said weights and wherein said interpolation adjustor outputs final color values which define an output image signal. 